github.com/klauspost/compress/zstd.prevEntry.prev (field)

46 uses

	github.com/klauspost/compress/zstd (current package)
		enc_best.go#L98: 			v2 := e.table[i].prev
		enc_best.go#L112: 				prev:   v2,
		enc_best.go#L117: 			v2 := e.longTable[i].prev
		enc_best.go#L131: 				prev:   v2,
		enc_best.go#L260: 		improve(&best, candidateL.prev-e.cur, s, uint32(cv), -1)
		enc_best.go#L262: 		improve(&best, candidateS.prev-e.cur, s, uint32(cv), -1)
		enc_best.go#L291: 		e.longTable[nextHashL] = prevEntry{offset: s + e.cur, prev: candidateL.offset}
		enc_best.go#L292: 		e.table[nextHashS] = prevEntry{offset: s + e.cur, prev: candidateS.offset}
		enc_best.go#L316: 			improve(&best, candidateL.prev-e.cur, s+1, uint32(cv), -1)
		enc_best.go#L318: 			improve(&best, candidateL2.prev-e.cur, s+2, uint32(cv2), -1)
		enc_best.go#L338: 						if off := candidateEnd.prev - e.cur - best.length + skipBeginning; off >= 0 {
		enc_best.go#L386: 				e.longTable[h0] = prevEntry{offset: off, prev: e.longTable[h0].offset}
		enc_best.go#L387: 				e.table[h1] = prevEntry{offset: off, prev: e.table[h1].offset}
		enc_best.go#L446: 			e.longTable[h0] = prevEntry{offset: off, prev: e.longTable[h0].offset}
		enc_best.go#L447: 			e.table[h1] = prevEntry{offset: off, prev: e.table[h1].offset}
		enc_best.go#L500: 				prev:   e.dictTable[nextHash].offset,
		enc_best.go#L504: 				prev:   e.dictTable[nextHash1].offset,
		enc_best.go#L508: 				prev:   e.dictTable[nextHash2].offset,
		enc_best.go#L512: 				prev:   e.dictTable[nextHash3].offset,
		enc_best.go#L530: 				prev:   e.dictLongTable[h].offset,
		enc_best.go#L540: 					prev:   e.dictLongTable[h].offset,
		enc_better.go#L31: 	prev   int32
		enc_better.go#L85: 			v2 := e.longTable[i].prev
		enc_better.go#L99: 				prev:   v2,
		enc_better.go#L174: 			e.longTable[nextHashL] = prevEntry{offset: off, prev: candidateL.offset}
		enc_better.go#L226: 						e.longTable[h0] = prevEntry{offset: off, prev: e.longTable[h0].offset}
		enc_better.go#L283: 						e.longTable[h0] = prevEntry{offset: off, prev: e.longTable[h0].offset}
		enc_better.go#L295: 			coffsetLP := candidateL.prev - e.cur
		enc_better.go#L364: 				e.longTable[nextHashL] = prevEntry{offset: s + checkAt + e.cur, prev: candidateL.offset}
		enc_better.go#L380: 				coffsetL = candidateL.prev - e.cur
		enc_better.go#L446: 				coffsetL = candidateL.prev - e.cur - matched + skipBeginning
		enc_better.go#L508: 			e.longTable[h0] = prevEntry{offset: off, prev: e.longTable[h0].offset}
		enc_better.go#L535: 			e.longTable[nextHashL] = prevEntry{offset: s + e.cur, prev: e.longTable[nextHashL].offset}
		enc_better.go#L613: 			v2 := e.longTable[i].prev
		enc_better.go#L627: 				prev:   v2,
		enc_better.go#L692: 			e.longTable[nextHashL] = prevEntry{offset: off, prev: candidateL.offset}
		enc_better.go#L745: 						e.longTable[h0] = prevEntry{offset: off, prev: e.longTable[h0].offset}
		enc_better.go#L805: 						e.longTable[h0] = prevEntry{offset: off, prev: e.longTable[h0].offset}
		enc_better.go#L820: 			coffsetLP := candidateL.prev - e.cur
		enc_better.go#L889: 				e.longTable[nextHashL] = prevEntry{offset: s + checkAt + e.cur, prev: candidateL.offset}
		enc_better.go#L906: 				coffsetL = candidateL.prev - e.cur
		enc_better.go#L963: 				coffsetL = candidateL.prev - e.cur - matched
		enc_better.go#L1024: 			e.longTable[h0] = prevEntry{offset: off, prev: e.longTable[h0].offset}
		enc_better.go#L1054: 			e.longTable[nextHashL] = prevEntry{offset: s + e.cur, prev: e.longTable[nextHashL].offset}
		enc_better.go#L1154: 				prev:   e.dictLongTable[h].offset,
		enc_better.go#L1164: 					prev:   e.dictLongTable[h].offset,